Multilevel Logic Synthesis for Cellular FPGAs Based on Orthogonal Expansions
نویسندگان
چکیده
The cellular ne grain architectures of new Field Programmable Gate Arrays FPGAs require spe cial logic synthesis tools Therefore this paper ad dresses multilevel logic synthesis methods based on or thogonal expansions for such kind of architectures First the concepts of the Binary Decision Diagrams BDDs their derivatives and the Functional De cision Diagrams FDDs which are applied to the technology mapping to Field Programmable Gate Ar rays FPGAs are generalized here to the Kronecker Functional Decision Diagram KFDD with negated edges Three other new types of functional decision diagrams are also introduced If Then Else KFDDs Mixed KFDDs and Permuted KFDDs The intro duced KFDD is based on three orthogonal Davio expansions and is created here also for multi output incompletely speci ed Boolean functions Next the KFDD creating algorithm being a basis of heuristic mapping program to ATMEL cellular FPGAs is also presented Besides this application our algorithm was adopted for technology mapping to Multiplexer Based MB and Table Look Up TLU based archi tectures
منابع مشابه
LOT: Logic Optimization with Testability. New transformations for logic synthesis
A new approach to optimize multilevel logic circuits is introduced. Given a multilevel circuit, the synthesis method optimizes its area while simultaneously enhancing its random pattern testability. The method is based on structural transformations at the gate level. New transformations involving EX-OR gates as well as Reed–Muller expansions have been introduced in the synthesis of multilevel c...
متن کاملQuasi-orthogonal expansions for functions in BMO
For {φ_n(x)}, x ε [0,1] an orthonormalsystem of uniformly bounded functions, ||φ_n||_{∞}≤ M
متن کاملMulti-level Logic Synthesis Based on Kronecker Decision Diagrams and Boolean Ternary Decision Diagrams for Incompletely Speci ed Functions
This paper introduces several new families of decision diagrams for multi output Boolean functions The in troduced by us families include several diagrams known from literature BDDs FDDs as subsets Due to this property our diagrams can provide a more compact representation of functions than either of the two decision diagrams Kronecker Decision Diagrams KDDs with negated edges are based on thre...
متن کاملMultilevel Logic Minimization Using K-map XOR Patterns
OMBINING entered variable (EV) subfunctions and C XOR patterns in a Karnaugh map (K-map) extraction process [3] is a special and powerful form of K-map multilevel function minimization. Used with two-level logic forms (AND and OR functions) this multilevel minimization approach leads to XOIUSOP, EQVPOS and hybrid forms that often represent a substantial reduction in the hardware not possible ot...
متن کاملEffective and Efficient Circuit Synthesis for LUT FPGAs Based on Functional Decomposition and Information Relationship Measures
The narrowing opportunity window and the dramatically increasing development costs of deep sub-micron application specific integrated circuit (ASIC) designs have presented new challenges to the development process. The cost of ASICs development and fabrication is presently so high that more and more companies are seeking alternative implementation platforms. Today, programmable logic devices (P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006